Working with Multivariate Polynomials in Maple
نویسنده
چکیده
We comment on the implementation of various algorithms in multivariate polynomial theory. Specifically, we describe a modular computation of triangular sets and possible applications. Next we discuss an implementation of the F4 algorithm for computing Gröbner bases. We also give examples of how to use Gröbner bases for vanishing ideals in polynomial and rational function interpolation.
منابع مشابه
Tropical Algebraic Geometry in Maple a preprocessing algorithm for finding common factors to multivariate polynomials with approximate coefficients
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral methods on the exact exponents with numerical techniques on the approximate coefficients. With Maple we will illustrate our use of tropical algebraic geometry.
متن کاملTropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view of this problem leads to efficient preprocessing techniques, applying polyhedral methods on the exact exponents with numerical techniques on the approximate coefficients. With Maple we will illustrate our use of tropical algebraic geometry.
متن کاملUsing Sparse Interpolation in Hensel Lifting
The standard approach to factor a multivariate polynomial in Z[x1, x2, . . . , xn] is to factor a univariate image in Z[x1] then lift the factors of the image one variable at a time using Hensel lifting to recover the multivariate factors. At each step one must solve a multivariate polynomial Diophantine equation. For polynomials in many variables with many terms we find that solving these mult...
متن کاملcient Multivariate Factorization Over
We describe the Maple 23] implementation of multivariate factorization over general nite elds. Our rst implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its eeciency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general tool for im...
متن کاملEfficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general to...
متن کامل